Characterizing the Common Prior Assumption

نویسنده

  • Joseph Y. Halpern
چکیده

Logical characterizations of the common prior assumption (CPA) are investigated. Two approaches are considered. The first is called frame distinguishability, and is similar in spirit to the approaches considered in the economics literature. Results similar to those obtained in the economics literature are proved here as well, namely, that we can distinguish finite spaces that satisfy the CPA from those that do not in terms of disagreements in expectation. However, it is shown that, for the language used here, no formulas can distinguish infinite spaces satisfying the CPA from those that do not. The second approach considered is that of finding a sound and complete axiomatization. Such an axiomatization is provided; again, the key axiom involves disagreements in expectation. The same axiom system is shown to be sound and complete both in the finite and the infinite case. Thus, the two approaches to characterizing the CPA behave quite differently in the case of infinite spaces.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Conditions for Characterizing Minimum Face in Non-Radial DEA Models with Undesirable Outputs

The problem of utilizing undesirable (bad) outputs in DEA models often need replacing the assumption of free disposability of outputs by weak disposability of outputs. The Kuosmanen technology is the only correct representation of the fully convex technology exhibiting weak disposability of bad and good outputs. Also, there are some specific features of non-radial data envelopment analysis (DEA...

متن کامل

A New Bootstrap Based Algorithm for Hotelling’s T2 Multivariate Control Chart

Normality is a common assumption for many quality control charts. One should expect misleading results once this assumption is violated. In order to avoid this pitfall, we need to evaluate this assumption prior to the use of control charts which require normality assumption. However, in certain cases either this assumption is overlooked or it is hard to check. Robust control charts and bootstra...

متن کامل

Finite Order Implications of Common Priors in Infinite Models

Lipman [2003] shows that in a finite model, the common prior assumption has weak implications for finite orders of beliefs about beliefs. In particular, the only such implications are those stemming from the weaker assumption of a common support. To explore the role of the finite model assumption in generating this conclusion, this paper considers the finite order implications of common priors ...

متن کامل

Finite Order Implications of Common Priors in Infinite Models1

Lipman [2003] shows that in a finite model, the common prior assumption has weak implications for finite orders of beliefs about beliefs. In particular, the only such implications are those stemming from the weaker assumption of a common support. To explore the role of the finite model assumption in generating this conclusion, this paper considers the finite order implications of common priors ...

متن کامل

Agreeing to disagree with lexicographic prior beliefs

The robustness of Aumann’s seminal agreement theorem with respect to the common prior assumption is considered. More precisely, we show by means of an example that two Bayesian agents with almost identical prior beliefs can agree to completely disagree on their posterior beliefs. Secondly, a more detailed agent model is introduced where posterior beliefs are formed on the basis of lexicographic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998